Minimally strong subgraph (k,l)-arc-connected digraphs
نویسندگان
چکیده
منابع مشابه
Super-connected arc-transitive digraphs
A digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set or in-neighbor set of a vertex. A digraph is said to be reducible, if there are two vertices with the same out-neighbor set or the same in-neighbor set. In this paper, we prove that a strongly connected arc-transitive oriented graph is either reducible or super-connected. Furthermore, if this digraph is ...
متن کاملSupereulerian Digraphs with Large Arc-Strong Connectivity
Let D be a digraph and let λ(D) be the arc-strong connectivity of D, and α′(D) be the size of a maximum matching of D. We proved that if λ(D) ≥ α′(D) > 0, then D has a spanning eulerian subdigraph. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 393–402, 2016
متن کاملDegree sequence for k-arc strongly connected multiple digraphs
Let D be a digraph on [Formula: see text]. Then the sequence [Formula: see text] is called the degree sequence of D. For any given sequence of pairs of integers [Formula: see text], if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable and D is a realization of d. In this paper, characterizations for k-arc-connected realizable sequenc...
متن کاملSufficient conditions for maximally edge-connected graphs and arc-connected digraphs
A connected graph with edge connectivity λ and minimum degree δ is called maximally edge-connected if λ = δ. A strongly connected digraph with arc connectivity λ and minimum degree δ is called maximally arc-connected if λ = δ. In this paper, some new sufficient conditions are presented for maximally edge-connected graphs and arc-connected digraphs. We only consider finite graphs (digraphs) with...
متن کاملStrong subgraph $k$-connectivity bounds
Let D = (V,A) be a digraph of order n, S a subset of V of size k and 2 ≤ k ≤ n. Strong subgraphs D1, . . . , Dp containing S are said to be internally disjoint if V (Di)∩V (Dj) = S and A(Di)∩A(Dj) = ∅ for all 1 ≤ i < j ≤ p. Let κS(D) be the maximum number of internally disjoint strong digraphs containing S in D. The strong subgraph kconnectivity is defined as κk(D) = min{κS(D) | S ⊆ V, |S| = k}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2301